Noncrossing trees are almost conditioned Galton-Watson trees
نویسندگان
چکیده
منابع مشابه
Noncrossing trees are almost conditioned Galton-Watson trees
A non-crossing tree (NC-tree) is a tree drawn on the plane having as vertices a set of points on the boundary of a circle, and whose edges are straight line segments that do not cross. In this paper, we show that NC-trees with size n are conditioned Galton–Watson trees. As corollaries, we give the limit law of depth-first traversal processes and the limit profile of NC-trees.
متن کاملA Note on Conditioned Galton-watson Trees
We give a necessary and sufficient condition for the convergence in distribution of a conditioned Galton-Watson tree to Kesten’s tree. This yields elementary proofs of Kesten’s result as well as other known results on local limit of conditioned Galton-Watson trees. We then apply this condition to get new results, in the critical and sub-critical cases, on the limit in distribution of a Galton-W...
متن کاملConditioned Galton–Watson trees do not grow
A conditioned Galton–Watson tree is a random rooted tree that is (or has the same distribution as) the family tree of a Galton–Watson process with some given offspring distribution, conditioned on the total number of vertices. We let ξ be a random variable with the given offspring distribution; i.e., the number of offspring of each individual in the Galton–Watson process is a copy of ξ. We let ...
متن کاملSimply generated trees and conditioned Galton–Watson trees
The trees that we consider are rooted and ordered (= plane); thus each node v has a number of children, ordered in a sequence v1, . . . , vd, where d = d(v) ≥ 0 is the outdegree of v. (See [1] for more information on these and other types of trees; the trees we consider are there called planted plane trees.) We let Tn denote the set of all ordered rooted trees with n nodes (including the root) ...
متن کاملSubcritical Galton-Watson Trees
Each variable X is a new, independent Uniform [0, 1] random number. For example, T = ∅ with probability 1−p, T = (∅, ∅) with probability p(1−p)2, and T = ((∅, ∅), ∅) with probability p2(1− p). The number of vertices N is equal to twice the number of left parentheses (parents) in the expression for T , plus one. Equivalently, N is twice the number of ∅s (leaves), minus one. It can be shown that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2002
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.10016